Tree-valued Markov chains and Poisson-Galton-Watson distributions
نویسنده
چکیده
The Poisson-Galton-Watson distribution on nite trees, and the related PGW 1 (1) distribution on innnite trees with one end, arise in several contexts, in particular as n ! 1 weak limits within various size-n combinato-rial models. We review this topic, introducingslick notation for describing such distributions. We then describe a family of continuous-time Markov chains whose marginal distributions are of Poisson-Galton-Watson type. Diierent chains in this family have connections with diierent parts of the extensive literature on tree and forest-valued chains (the random graph process, stochastic coalescence, spanning tree chains) and also illustrate the classical state-space-compactiication theory of continuous-time countable-state chains.
منابع مشابه
Tree-valued Markov Chains Derived from Galton-watson Processes
Let G be a Galton-Watson tree, and for 0 u 1 let Gu be the subtree of G obtained by retaining each edge with probability u. We study the tree-valued Markov process (Gu; 0 u 1) and an analogous process (G u; 0 u 1) in which G 1 is a critical or subcritical Galton-Watson tree conditioned to be in nite. Results simplify and are further developed in the special case of Poisson( ) o spring distribut...
متن کاملPruning Galton-Watson Trees and Tree-valued Markov Processes
Abstract. We present a new pruning procedure on discrete trees by adding marks on the nodes of trees. This procedure allows us to construct and study a tree-valued Markov process {G(u)} by pruning Galton-Watson trees and an analogous process {G(u)} by pruning a critical or subcritical Galton-Watson tree conditioned to be infinite. Under a mild condition on offspring distributions, we show that ...
متن کاملGráfok homomorfizmusai
References [1] R. Albert and A.-L. Barabsi: Statistical mechanics of complex networks, Reviews of Modern Physics 74 (2002), 47–97. [2] D.J. Aldous: Tree-valued Markov chains and Poisson-Galton-Watson distributions, in: Microsurveys in Discrete Probability (D. Aldous and J. Propp, editors), DIMACS Ser. Discrete Math. Theoret. Comput. Sci. 41 (1998) Amer. Math. Soc., Providence, RI. (1998), 1–20....
متن کاملScaling limits of Markov branching trees, with applications to Galton-Watson and random unordered trees
We consider a family of random trees satisfying a Markov branching property. Roughly, this property says that the subtrees above some given height are independent with a law that depends only on their total size, the latter being either the number of leaves or vertices. Such families are parameterized by sequences of distributions on partitions of the integers, that determine how the size of a ...
متن کاملCutting down trees with a Markov chainsaw
We provide simplified proofs for the asymptotic distribution of the number of cuts required to cut down a Galton–Watson tree with critical, finite-variance offspring distribution, conditioned to have total progeny n. Our proof is based on a coupling which yields a precise, non-asymptotic distributional result for the case of uniformly random rooted labeled trees (or, equivalently, Poisson Galto...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997